A Multiplier Adjustment Approach for the Set Partitioning Problem
نویسندگان
چکیده
منابع مشابه
A Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملa local branching approach for the set covering problem
the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA dual ascent procedure for the set partitioning problem
The set partitioning problem is a fundamental model for many important real-life transportation problems, including airline crew and bus driver scheduling and vehicle routing. In this paper we propose a new dual ascent heuristic and an exact method for the set partitioning problem. The dual ascent heuristic finds an effective dual solution of the linear relaxation of the set partitioning proble...
متن کاملA Parallel Genetic Algorithm for the Set Partitioning Problem
In this dissertation we report on our e orts to develop a parallel genetic algorithm and apply it to the solution of the set partitioning problem|a di cult combinatorial optimization problem used by many airlines as a mathematical model for ight crew scheduling. We developed a distributed steady-state genetic algorithm in conjunction with a specialized local search heuristic for solving the set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1992
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.40.1.s40